Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times

نویسندگان

  • Silvio A. de Araujo
  • Bert De Reyck
  • Zeger Degraeve
  • Ioannis Fragkos
  • Raf Jans
چکیده

Sizing Problem with Setup Times Silvio Alexandre de Araujo Departamento de Matemática Aplicada, Universidade Estadual Paulista, São José do Rio Preto SP, 15054-000, Brazil [email protected] Bert De Reyck Department of Management Science and Innovation, University College London, WC1E 6BT, UK [email protected] Zeger Degraeve Melbourne Business School, University of Melbourne, Carlton VIC 3053, [email protected] Department of Mamagement Science and Operations, London Business School, Regents Park, London NW1 4SA, UK [email protected] Ioannis Fragkos Department of Management Science and Innovation, University College London, WC1E 6BT, UK [email protected] Raf Jans HEC Montréal, H3T 2A7 QC, Canada [email protected]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Three Meta-heuristic Algorithms for the Single-item Capacitated Lot-sizing Problem (RESEARCH NOTE)

This paper proposes a mixed integer programming model for single-item capacitated lot-sizing problem with setup times, safety stock, demand shortages, outsourcing and inventory capacity. Due to the complexity of problem, three meta-heuristics algorithms named simulated annealing (SA), vibration damping optimization (VDO) and harmony search (HS) have been used to solve this model. Additionally, ...

متن کامل

Three Metaheuristic Algorithms for Solving the Multi-item Capacitated Lot-sizing Problem with Product Returns and Remanufacturing

This paper proposes a new mixed integer programming model for multi-item capacitated lot-sizing problem with setup times, safety stock and demand shortages in closed-loop supply chains. The returned products from customers can either be disposed or be remanufactured to be sold as new ones again. Due to the complexity of problem, three meta-heuristics algorithms named simulated annealing (SA) al...

متن کامل

A Multi-level Capacitated Lot-sizing Problem with Safety Stock Deficit and Production Manners: A Revised Simulated Annealing

[1] Corresponding author e-mail: [email protected]   [1] Corresponding author e-mail: [email protected]   Lot-sizing problems (LSPs) belong to the class of production planning problems in which the availability quantities of the production plan are always considered as a decision variable. This paper aims at developing a new mathematical model for the multi-level ca...

متن کامل

Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic

This paper presents a new algorithm for the dynamic Multi-Level Capacitated Lot Sizing Problem with Setup Carry-Overs (MLCLSP-L). The MLCLSP-L is a big-bucket model that allows the production of any number of products within a period, but it incorporates partial sequencing of the production orders in the sense that the first and the last product produced in a period are determined by the model....

متن کامل

www.econstor.eu Solving a Multi-Level Capacitated Lot Sizing Problem with Multi-Period Setup Carry-Over via a Fix-and-Optimize Heuristic

This paper presents a new algorithm for the dynamic Multi-Level Capacitated Lot Sizing Problem with Setup Carry-Overs (MLCLSP-L). The MLCLSP-L is a big-bucket model that allows the production of any number of products within a period, but it incorporates partial sequencing of the production orders in the sense that the first and the last product produced in a period are determined by the model....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • INFORMS Journal on Computing

دوره 27  شماره 

صفحات  -

تاریخ انتشار 2015